package com.banmao.algorithm.No101To200.No102;

import java.util.List;

public class Answer {

    public static void main(String[] args) {
        TreeNode root = new TreeNode(3, new TreeNode(9), new TreeNode(20, new TreeNode(15), new TreeNode(7)));

        Solution1 solution = new Solution1();

        List<List<Integer>> result = solution.levelOrder(root);

        for (List<Integer> list : result) {
            for (Integer i : list) {
                System.out.print(i + " ");
            }
            System.out.println();
        }

    }
}
